منابع مشابه
F-saturation games
We study F-saturation games, rst introduced by Füredi, Reimer and Seress [4] in 1991, and named as such by West [5]. The main question is to determine the length of the game whilst avoiding various classes of graph, playing on a large complete graph. We show lower bounds on the length of path-avoiding games, and more precise results for short paths. We show sharp results for the tree avoiding g...
متن کاملGraph Saturation Games
We study F-saturation games, first introduced by Füredi, Reimer and Seress [1] in 1991, and named as such by West [2]. A graph G is H-saturated if H is not a subgraph of G, but adding any edge to G causes H to be a subgraph. We can ask what the minimum or maximum number of edges in an H-saturated graph on n vertices is they are known as the saturation number and Turán number (extremal number), ...
متن کاملOn saturation games
A graph G = (V,E) is said to be saturated with respect to a monotone increasing graph property P, if G / ∈ P but G ∪ {e} ∈ P for every e ∈ ( V 2 ) \ E. The saturation game (n,P) is played as follows. Two players, called Mini and Max, progressively build a graph G ⊆ Kn, which does not satisfy P. Starting with the empty graph on n vertices, the two players take turns adding edges e ∈ ( V (Kn) 2 )...
متن کاملColorability Saturation Games
We consider the following two-player game: Maxi and Mini start with the empty graph on n vertices and take turns, always adding one additional edge to the graph such that the chromatic number is at most k, where k ∈ N is a given parameter. The game is over when the graph is saturated and no further edge can be inserted. Maxi wants to maximize the length of the game while Mini wants to minimize ...
متن کاملGames and Definability for System F
We present a game-theoretic model of the polymorphic λ-calculus, system F , as a fibred category. Every morphism σ of the model defines an η-expanded, β-normal form σ̂ of system F whose interpretation is σ. Thus the model gives a precise, non-syntactic account of the calculus.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2015
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.05.028